/*
 * One example for NOI CSP-J Lesson 10:
 * <https://courses.fmsoft.cn/plzs/noijunior-csp-exercises-lower.html>
 *
 * Author: Vincent Wei
 *  - <https://github.com/VincentWei>
 *  - <https://gitee.com/vincentwei7>
 *
 * Copyright (C) 2025 FMSoft <https://www.fmsoft.cn>.
 * License: GPLv3
 */
#include <iostream>
#include <cassert>

using namespace std;

int climbing_worm(int n, int u, int d)
{
    int times = 0, distance = 0;

    while (true) {
        distance += u;
        times++;
        if (distance >= n)
            break;

        distance -= d;
    }

    return times;
}

int main() {
    int got = climbing_worm(10, 1, 0);
    clog << got << endl;
    assert(got == 10);

    int n, u, d;
    cin >> n >> u >> d;

    cout << climbing_worm(n, u, d) << endl;
    return 0;
}

